package test.examation;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class 百度 {
    public static void main(String[] args) {
        //m1();


    }

    private static void m1() {
        Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();

        for(int i=1;i<=t;i++){
            int n=sc.nextInt();//小伙伴
            int m=sc.nextInt();//角色

            int want[]=new int[n];//每个人想要的最少戏份值
            int role_rest[]=new int[m];

            for(int j=0;j<n;j++){
                want[j]=sc.nextInt();
            }
            for(int k=0;k<m;k++){
                role_rest[k]=sc.nextInt();
            }
            int res[]=new int[n];
            for(int q=0;q<n;q++){
                int count=0;
                for(int p=0;p<m;p++){
                    if(role_rest[p]>want[q]){
                        count++;
                    }
                }
                res[q]=count;
            }
            //二分查找优化





            for (int re : res) {
                System.out.print(re+" ");
            }
            System.out.println();

        }
    }
}
